Some criteria for a signed graph to have full rank
نویسندگان
چکیده
منابع مشابه
The H - Line Signed Graph of a Signed Graph
A Smarandachely k-signed graph (Smarandachely k-marked graph) is an ordered pair S = (G,σ) (S = (G,μ)) where G = (V, E) is a graph called underlying graph of S and σ : E → (e1, e2, ..., ek) (μ : V → (e1, e2, ..., ek)) is a function, where each ei ∈ {+,−}. Particularly, a Smarandachely 2-signed graph or Smarandachely 2-marked graph is called abbreviated a signed graph or a marked graph. Given a ...
متن کاملA new multi-step ABS model to solve full row rank linear systems
ABS methods are direct iterative methods for solving linear systems of equations, where the i-th iteration satisfies the first i equations. Thus, a system of m equations is solved in at most m ABS iterates. In 2004 and 2007, two-step ABS methods were introduced in at most [((m+1))/2] steps to solve full row rank linear systems of equations. These methods consuming less space, are more compress ...
متن کاملWilcoxon signed rank test for imprecise observations
This article extends the Wilcoxon signed rank test for testing whether the median of a population is a specified constant by treating the observations as imprecise values. The test procedure is developed by using the concepts of “Credibility Theory” for studying the behavior of fuzzy phenomena. Numerical illustration of the proposed test is provided by representing the observations as trapezoid...
متن کاملa new model for fuzzy multiple criteria decision making to rank suppliers (case study: advertising company)
one of important issues in designing a supply chain is supplier selection. this issue is complicated, because each supplier should satisfy some criteria from buyer and choosing among them is actually a multi criteria decision making problem. so, there is a need for a structured and systematic approach to solve this problem. in this article, we address supplier selection in an advertising indust...
متن کاملSome bounds for the signed edge domination number of a graph
The closed neighbourhood NG[e] of an edge e in a graph G is the set consisting of e and of all edges having a common end vertex with e. Let f be a function on the edges of G into the set {−1, 1}. If e∈NG[x] f(e) ≥ 1 for every x ∈ E(G), then f is called a signed edge domination function of G. The minimum value of ∑ x∈E(G) f(x), taken over every signed edge domination function f of G, is called s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2020
ISSN: 0012-365X
DOI: 10.1016/j.disc.2020.111910